全文获取类型
收费全文 | 17103篇 |
免费 | 1433篇 |
国内免费 | 1048篇 |
专业分类
电工技术 | 1575篇 |
综合类 | 2133篇 |
化学工业 | 692篇 |
金属工艺 | 458篇 |
机械仪表 | 1197篇 |
建筑科学 | 479篇 |
矿业工程 | 278篇 |
能源动力 | 428篇 |
轻工业 | 158篇 |
水利工程 | 378篇 |
石油天然气 | 204篇 |
武器工业 | 134篇 |
无线电 | 1121篇 |
一般工业技术 | 1395篇 |
冶金工业 | 213篇 |
原子能技术 | 48篇 |
自动化技术 | 8693篇 |
出版年
2024年 | 22篇 |
2023年 | 140篇 |
2022年 | 218篇 |
2021年 | 275篇 |
2020年 | 372篇 |
2019年 | 422篇 |
2018年 | 337篇 |
2017年 | 506篇 |
2016年 | 541篇 |
2015年 | 614篇 |
2014年 | 919篇 |
2013年 | 1323篇 |
2012年 | 1001篇 |
2011年 | 1098篇 |
2010年 | 851篇 |
2009年 | 976篇 |
2008年 | 1056篇 |
2007年 | 1131篇 |
2006年 | 1005篇 |
2005年 | 865篇 |
2004年 | 743篇 |
2003年 | 668篇 |
2002年 | 609篇 |
2001年 | 508篇 |
2000年 | 433篇 |
1999年 | 382篇 |
1998年 | 300篇 |
1997年 | 312篇 |
1996年 | 270篇 |
1995年 | 245篇 |
1994年 | 250篇 |
1993年 | 185篇 |
1992年 | 172篇 |
1991年 | 140篇 |
1990年 | 104篇 |
1989年 | 97篇 |
1988年 | 88篇 |
1987年 | 52篇 |
1986年 | 52篇 |
1985年 | 36篇 |
1984年 | 51篇 |
1983年 | 30篇 |
1982年 | 36篇 |
1981年 | 23篇 |
1980年 | 23篇 |
1979年 | 29篇 |
1978年 | 11篇 |
1977年 | 21篇 |
1976年 | 14篇 |
1975年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
41.
In revenue management, the profitability of the inventory and pricing decisions rests on the accuracy of demand forecasts. However, whenever a product is no longer available, true demand may differ from registered bookings, thus inducing a negative bias in the estimation figures, as well as an artificial increase in demand for substitute products. In order to address these issues, we propose an original Mixed Integer Nonlinear Program (MINLP) to estimate product utilities as well as capturing seasonal effects. This behavioral model solely rests on daily registered bookings and product availabilities. Its outputs are the product utilities and daily potential demands, together with the expected demand of each product within any given time interval. Those are obtained via a tailored algorithm that outperforms two well-known generic software for global optimization. 相似文献
42.
Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study. 相似文献
43.
Optimization of leakage power is essential for nanoscale CMOS (nano-CMOS) technology based integrated circuits for numerous reasons, including improving battery life of the system in which they are used as well as enhancing reliability. Leakage optimization at an early stage of the design cycle such as the register-transfer level (RTL) or architectural level provides more degrees of freedom to design engineers and ensures that the design is optimized at higher levels before proceeding to the next and more detailed phases of the design cycle. In this paper, an RTL optimization approach is presented that targets leakage-power optimization while performing simultaneous scheduling, allocation and binding. The optimization approach uses a nature-inspired firefly algorithm so that large digital integrated circuits can be effectively handled without convergence issues. The firefly algorithm optimizes the cost of leakage delay product (LDP) under various resource constraints. As a specific example, gate-oxide leakage is optimized using a 45 nm CMOS dual-oxide based pre-characterized datapath library. Experimental results over various architectural level benchmark integrated circuits show that average leakage optimization of 90% can be obtained. For a comparative perspective, an integer linear programming (ILP) based algorithm is also presented and it is observed that the firefly algorithm is as accurate as ILP while converging much faster. To the best of the authors׳ knowledge, this is the first ever paper that applies firefly based algorithms for RTL optimization. 相似文献
44.
In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models. 相似文献
45.
Engineered transport of material at the nano/micro scale is essential for the manufacturing platforms of the future. Unlike conventional transport systems, at the nano/micro scale, transport has to be achieved in the presence of fundamental sources of uncertainty such as thermal noise. Remarkably, it is possible to extract useful work by rectifying noise using an asymmetric potential; a principle used by Brownian ratchets. In this article a systematic methodology for designing open-loop Brownian ratchet mechanisms that optimize velocity and efficiency is developed. In the case where the particle position is available as a measured variable, closed loop methodologies are studied. Here, it is shown that methods that strive to optimize velocity of transport may compromise efficiency. A dynamic programming based approach is presented which yields up to three times improvement in efficiency over optimized open loop designs and 35% better efficiency over reported closed loop strategies that focus on optimizing velocities. 相似文献
46.
We consider the switched-affine optimal control problem, i.e., the problem of selecting a sequence of affine dynamics from a finite set in order to minimize a sum of convex functions of the system state. We develop a new reduction of this problem to a mixed-integer convex program (MICP), based on perspective functions. Relaxing the integer constraints of this MICP results in a convex optimization problem, whose optimal value is a lower bound on the original problem value. We show that this bound is at least as tight as similar bounds obtained from two other well-known MICP reductions (via conversion to a mixed logical dynamical system, and by generalized disjunctive programming), and our numerical study indicates it is often substantially tighter. Using simple integer-rounding techniques, we can also use our formulation to obtain an upper bound (and corresponding sequence of control inputs). In our numerical study, this bound was typically within a few percent of the optimal value, making it attractive as a stand-alone heuristic, or as a subroutine in a global algorithm such as branch and bound. We conclude with some extensions of our formulation to problems with switching costs and piecewise affine dynamics. 相似文献
47.
In this work, we propose two novel classifiers for multi-class classification problems using mathematical programming optimisation techniques. A hyper box-based classifier (Xu & Papageorgiou, 2009) that iteratively constructs hyper boxes to enclose samples of different classes has been adopted. We firstly propose a new solution procedure that updates the sample weights during each iteration, which tweaks the model to favour those difficult samples in the next iteration and therefore achieves a better final solution. Through a number of real world data classification problems, we demonstrate that the proposed refined classifier results in consistently good classification performance, outperforming the original hyper box classifier and a number of other state-of-the-art classifiers.Furthermore, we introduce a simple data space partition method to reduce the computational cost of the proposed sample re-weighting hyper box classifier. The partition method partitions the original dataset into two disjoint regions, followed by training sample re-weighting hyper box classifier for each region respectively. Through some real world datasets, we demonstrate the data space partition method considerably reduces the computational cost while maintaining the level of prediction accuracies. 相似文献
48.
This work studies the supply allocation problem, using a Stackelberg game, for an established timberlands supply chain with an additional decision of new biorefinery investments. In a timberlands system, harvester and manufacturer decision makers have separate objectives to maximize their respective profits. This interaction is represented with a turn based Stackelberg game. The harvesters decide first on the quantity harvested, and the manufacturers decide on how much to utilize. This game is modeled with a bilevel mathematical program. The novel feature of this paper's bilevel formulation is the inclusion of parametric uncertainty in a two stage model. The first stage problem involves logistical decisions around biorefinery investments, such as location and capacity, while the second stage problem involves a bilevel timberlands model with parameter uncertainty. Studying this problem formulation revealed interesting insights for solving multiperiod problems with bilevel stages as well as the decision maker's behavior for the timberlands model. 相似文献
49.
This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method. 相似文献
50.
Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem. 相似文献